Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars
نویسندگان
چکیده
منابع مشابه
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars
A distance-k dominating set S of a directed graph D is a set of vertices such that for every vertex v of D, there is a vertex u ∈ S at distance at most k from it. Minimum distance-k dominating set is especially important in communication networks for distributed data structure and for server placement. In this paper, we shall present simple distributed algorithms for finding the unique minimum ...
متن کاملDistributed Algorithms of Finding the Unique Minimum Distance Dominating Set in Directed Split-Stars
A distance-k dominating set S of a directed graph D is a set of vertices such that for every vertex v of D, there is a vertex u ∈ S at distance at most k from it. Minimum distance-k dominating set is especially important in communication networks for distributed data structure and for server placement. In this paper, we shall present simple distributed algorithms for finding the unique minimum ...
متن کاملExact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
In this paper, we consider theMinimum Independent Dominating Set problem and develop exact exponential algorithms that break the trivial O(2|V |) bound. A simple O∗( √ 3 |V | ) time algorithm is developed to solve this problem on general graphs. For sparse graphs, e.g. graphs with degree bounded by 3 and 4, we show that a few new branching techniques can be applied to these graphs and the resul...
متن کاملLearning Automata-Based Algorithms for Finding Minimum Weakly Connected Dominating Set in Stochastic Graphs
A weakly connected dominating set (WCDS) of graph is a subset of so that the vertex set of the given subset and all vertices with at least one endpoint in the subset induce a connected sub‐graph of . Finding the WCDS is a new promising approach for clustering the wireless networks. The minimum WCDS (MWCDS) problem is known to be NP‐hard, and several approximation algo...
متن کاملA Self-Stabilizing Algorithm for Finding a Minimal Distance-2 Dominating Set in Distributed Systems
The study of various dominating set problems is an important area within graph theory. In applications, a dominating set in a system can be considered as an ideal place for allocating resources. And, a minimal dominating set allows allocating a smaller number of resources. Distance-versions of the concept of minimal dominating sets are more applicable to modeling real-world problems, such as pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2003
ISSN: 0743-7315
DOI: 10.1016/s0743-7315(03)00040-6